Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
841	What is Exploring Computer Science? Computing is involved in nearly every field of study, career and industry today. Exploring Computer Science (ECS) is a high school course that provides students with an introduction to Add to Reading List Source URL: www.exploringcs.org Language: English - Date: 2013-03-22 13:53:03 Electronics Outline of computer science Computational thinking Computer science Computer Problem solving
842	Viewpoint Jeannette M. Wing Computational Thinking It represents a universally applicable attitude and skill set everyone, not just Add to Reading List Source URL: exploringcs.org Language: English - Date: 2010-10-01 03:08:59 Science Theoretical computer science Open problems Alan Turing Philosophy of artificial intelligence Computer science Strong AI Quantum computer Turing test Problem solving Applied mathematics Computational thinking
843	COMP3170 Analysis of Algorithms and Data Strutures Add to Reading List Source URL: www.cs.umanitoba.ca Language: English - Date: 2007-11-06 12:31:11 Complexity classes Mathematical optimization NP-complete problems NP-complete Boolean satisfiability problem Approximation algorithm Algorithm NP Heap Theoretical computer science Applied mathematics Computational complexity theory
844	COMP 3190 – Introduction to Artificial Intelligence Calendar Description: Principles of artificial intelligence; problem solving, knowledge representation and manipulation; the application of these principles to the so Add to Reading List Source URL: www.cs.umanitoba.ca Language: English - Date: 2007-11-06 12:31:11 Programming paradigms Reasoning Computational neuroscience Logic programming Problem solving Neural network Knowledge representation and reasoning Expert system Frame problem Artificial intelligence Science Knowledge
845	Region of Attraction Estimation for a Perching Aircraft: A Lyapunov Method Exploiting Barrier Certificates Elena Glassman, Alexis Lussier Desbiens, Mark Tobenkin, Mark Cutkosky, and Russ Tedrake Abstract— Dynamic perch Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2012-02-11 15:36:05 Polynomial Mathematical optimization Lyapunov equation Mathematics Applied mathematics Theoretical computer science Computational problems Operations research Optimization problem
846	A Parallel Computational Framework for Solving Quadratic Assignment Problems Exactly Michael C. Yurko June 22, 2010 Abstract The Quadratic Assignment Problem (QAP) is a combinatorial optimization problem used to model a Add to Reading List Source URL: www.sciencebuddies.org Language: English - Date: 2012-06-08 15:30:40 Search algorithms Combinatorial optimization Theoretical computer science Heuristics Branch and bound Heuristic function Mathematical optimization A* search algorithm Heuristic Mathematics Applied mathematics Operations research
847	ECE 2240 Numerical Methods for Engineers Course Outline – Winter Term 2014 Course Objectives To obtain an understanding of numerical methods and how they can be used to solve electrical and computer engineering problem Add to Reading List Source URL: umanitoba.ca Language: English - Date: 2014-09-09 16:31:30 Numerical analysis Computational science Aggregate Ordinary differential equation Numerical integration Computer science Grade Numerical continuation Education Evaluation Knowledge
848	Success in Math and Science Classes Academic Success Center Iowa State University  Math and science are subjects that you think about by doing  Watching someone else work a problem is never enough  Time manageme Add to Reading List Source URL: www.dso.iastate.edu Language: English - Date: 2013-07-03 09:04:21 Semiotic information theory Operations research Computational complexity theory Peg solitaire
849	Advances in Cryptology – Proceedings of Crypto ’07 (August 19–[removed], Santa Barbara, CA) A. Menezes Ed. Springer-Verlag, LNCS 4622, pages 482–499. A generalization of DDH with applications to protocol analysis a Add to Reading List Source URL: www.ssi.gouv.fr Language: English - Date: 2012-11-06 05:29:19 Decisional Diffie–Hellman assumption Mathematics Diffie–Hellman problem XTR Diffie–Hellman key exchange Computational Diffie–Hellman assumption Computational hardness assumptions Finite fields Cryptographic protocols
850	Research Statement Scott Aaronson January 6, 2007 Most of my research deals with two questions: first, what are the ultimate limits on what can feasibly be computed in the physical world? Second, how can studying those l Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2007-01-11 00:07:45 Computational complexity theory Quantum information science Models of computation Quantum algorithm PP Quantum computer QMA BQP Hidden subgroup problem Theoretical computer science Applied mathematics Quantum complexity theory

UPDATE